Iteration methods for finding all zeros of a polynomial simultaneously
نویسندگان
چکیده
منابع مشابه
Simultaneous Methods for Finding All Zeros of a Polynomial
The purpose of this paper is to present three new methods for finding all simple zeros of polynomials simultaneously. First, we give a new method for finding simultaneously all simple zeros of polynomials constructed by applying the Weierstrass method to the zero in the trapezoidal Newton’s method, and prove the convergence of the method. We also present two modified Newton’s methods combined w...
متن کاملOn iteration methods without derivatives for the simultaneous determination of polynomial zeros
Carstensen, C. and M.S. PetkoviC, On iteration methods without derivatives for the simultaneous determination of polynomial zeros, Journal of Computational and Applied Mathematics 45 (1993) 251-266. Several algorithms for simultaneously approximating simple complex zeros of a polynomial are presented. These algorithms use Weierstrass’ corrections and do not require any polynomial derivatives. I...
متن کاملA Globally Convergent Method for Simultaneously Finding Polynomial Roots*
A new method for the simultaneous approximation of all the roots of a polynomial is given. The method converges for almost every initial approximation, the set of the exceptional starting points being a closed set of measure zero, at least if all the polynomial roots are real and simple. The method exhibits quadratic convergence not only to simple, but also to multiple roots.
متن کاملAn Algorithm for Finding All Zeros of Vector Functions
Computing a zero of a continuous function is an old and extensively researched problem in numerical computation. In this paper, we present an efficient subdivision algorithm for finding all real roots of a function in multiple variables. This algorithm is based on a simple computationally verifiable necessity test for existence of a root in any compact set. Both theoretical analysis and numeric...
متن کاملOn annuli containing all the zeros of a polynomial
In this paper, we obtain the annuli that contain all the zeros of the polynomial p(z) = a 0 + a 1 z + a 2 z 2 + · · · + a n z n , where a i 's are complex coefficients and z is a complex variable. Our results sharpen some of the recently obtained results in this direction. Also, we develop a MATLAB code to show that for some polynomials the bounds obtained by our results are considerably sharpe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1973
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1973-0329236-7